<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Member List</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="namespaceshark.html">shark</a></li><li class="navelem"><a class="el" href="classshark_1_1_k_d_tree.html">KDTree</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">shark::KDTree&lt; InputT &gt; Member List</div></div>
</div><!--header-->
<div class="contents">

<p>This is the complete list of members for <a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a>, including all inherited members.</p>
<table class="directory">
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a50b781f4203ea4d3a9e1dc60a52bec4e">BinaryTree</a>(std::size_t size)</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#ac92e6cbbc2318f60cf32112bf640138e">BinaryTree</a>(BinaryTree *parent, std::size_t *list, std::size_t size)</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a7ca41c2db8a6d814deef326dd0bbfa44">buildTree</a>(TreeConstruction tc, Range &amp;points)</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a7d49ee634a593c727aa4896c4d0683fc">calculateCuttingDimension</a>(Range const &amp;points) const</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#aa0d859e272e40b522cb3eb328b0e1f41">distanceFromPlane</a>(value_type const &amp;point) const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a54181d202a7a437f2dc0d632b06fca60">funct</a>(InputT const &amp;reference) const</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">virtual</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a8d5379344624257a1c2950d4e64ab8c0">hasChildren</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#ac499a09353aff38530837d22a16ad24a">index</a>(std::size_t point) const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a1876569a27c34141bbc4e3fbfe2367ef">isLeaf</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a456c9994792021b1bb2557cad4ab7a3e">isLeft</a>(value_type const &amp;point) const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#aaf824c0062811dfa4311a66292bb38be">isRight</a>(value_type const &amp;point) const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a3fe6b43b26ecb3a907753b0e275515c0">KDTree</a>(Data&lt; InputT &gt; const &amp;dataset, TreeConstruction tc=TreeConstruction())</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#aa30ad7dbf305495db5d052ba3eea483a">KDTree</a>(KDTree *parent, std::size_t *list, std::size_t size)</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">kernel</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">left</a>()</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a3b130767c5ff7c5233b0de89fb263221">left</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#aefe4d7d7a1833f518b5b3a3ad1adb520">lower</a>(std::size_t dim) const</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a34933db0a72046a41df17937fd4f5fa5">m_cutDim</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">m_nodes</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a825e00e68228cb1654b5ac0a25f4972a">m_size</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450">m_threshold</a></td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a100ef54d8a4904afff8c188bf4e735f9">mep_parent</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#afdce442d41868d9a84dcfc954c78ce93">mp_indexList</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">mp_left</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#acc95bb731d3bfac4a896820f8de04ad8">mp_right</a></td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb">nodes</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>()</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#acf31280508b15cf67be7b7b4d30e41f5">parent</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">right</a>()</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a57a5c5fd47bda6d5fc35774abfb9731f">right</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">splitList</a>(Range1 &amp;values, Range2 &amp;points)</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a68e44a697dc289c700c65658af6b3893">squaredDistanceLowerBound</a>(InputT const &amp;reference) const</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#ad7e43f9fa135d67d1817b2a7aa20b434">threshold</a>() const</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html#a80d8c03cbb03aa01f1b8a310bb7cf55d">upper</a>(std::size_t dim) const</td><td class="entry"><a class="el" href="classshark_1_1_k_d_tree.html">shark::KDTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="odd"><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html#a9928e5dcb0026028ef3f4cbf56fe8721">~BinaryTree</a>()</td><td class="entry"><a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">virtual</span></td></tr>
</table></div><!-- contents -->
</div>
</body>
</html>
